Graph traversal

Results: 141



#Item
51Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems Sang K. Cha Sangyong Hwang

Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems Sang K. Cha Sangyong Hwang

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2006-07-29 01:38:17
523.2 BINARY SEARCH TREES  Algorithms F O U R T H  R O B E R T

3.2 BINARY SEARCH TREES Algorithms F O U R T H R O B E R T

Add to Reading List

Source URL: t2.hhg.to

Language: English - Date: 2012-04-03 10:31:33
53Skip Lists: A Probabilistic Alternative to Balanced Trees Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as

Skip Lists: A Probabilistic Alternative to Balanced Trees Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2006-05-29 09:55:51
54CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:05:29
55Extracted from:  Language Implementation Patterns Create Your Own Domain-Specific and General Programming Languages

Extracted from: Language Implementation Patterns Create Your Own Domain-Specific and General Programming Languages

Add to Reading List

Source URL: media.pragprog.com

Language: English - Date: 2010-01-17 14:46:30
56Solving Large, Irregular Graph Problems using Adaptive Work-stealing Guojing Cong (IBM) Sreedhar Kodali (IBM) Sriram Krishnamoorthy (Ohio State) Doug Lea (SUNY Oswego) Vijay Saraswat (IBM)

Solving Large, Irregular Graph Problems using Adaptive Work-stealing Guojing Cong (IBM) Sreedhar Kodali (IBM) Sriram Krishnamoorthy (Ohio State) Doug Lea (SUNY Oswego) Vijay Saraswat (IBM)

Add to Reading List

Source URL: gee.cs.oswego.edu

Language: English - Date: 2008-07-07 20:18:19
57D:�eriments�y�ults�phs�y3-1.eps

D:erimentsyultsphsy3-1.eps

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-08-01 05:51:29
58A Portable Sampling-Based Profiler for Java Virtual Machines John Whaley IBM Tokyo Research Laboratory Network Computing Platform[removed]Shimotsuruma

A Portable Sampling-Based Profiler for Java Virtual Machines John Whaley IBM Tokyo Research Laboratory Network Computing Platform[removed]Shimotsuruma

Add to Reading List

Source URL: suif.stanford.edu

Language: English - Date: 2007-04-01 19:34:57
59Practical Authenticated Pattern Matching with Optimal Proof Size Dimitrios Papadopoulos Charalampos Papamanthou

Practical Authenticated Pattern Matching with Optimal Proof Size Dimitrios Papadopoulos Charalampos Papamanthou

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2015-02-15 22:06:23
60RTED: A Robust Algorithm for the Tree Edit Distance Mateusz Pawlik Nikolaus Augsten  Free University of Bozen-Bolzano

RTED: A Robust Algorithm for the Tree Edit Distance Mateusz Pawlik Nikolaus Augsten Free University of Bozen-Bolzano

Add to Reading List

Source URL: vldb.org

Language: English - Date: 2011-12-25 09:36:24